The use of the CADNA library for validating the numerical results of the hybrid GMRES algorithm
نویسنده
چکیده
Over the past several years a number of hybrid algorithms have been proposed for solving large sparse systems of linear algebraic equations. In this paper we consider the hybrid GMRES algorithm by Nachtigal, Reichel and Trefethen (1992) and show that in the floating-point arithmetic there exist some cases in which the properties of this algorithm are lost, e.g., the result is false, or the coefficients of the GMRES residual polynomial are non-significant and lead to serious round-off errors. The subject of this paper is to show how by using the CADNA library, it is possible during the run of the hybrid GMRES code to detect the numerical instabilities, to stop correctly the process, and to evaluate the accuracy of the results provided by the computer. Numerical examples are used to show the good numerical properties. © 1997 Elsevier Science B.V.
منابع مشابه
THE USE OF THE HE'S ITERATION METHOD FOR SOLVING NONLINEAR EQUATIONS USING CADNA LIBRARY
In this paper, we apply the Newton’s and He’s iteration formulas in order to solve the nonlinear algebraic equations. In this case, we use the stochastic arithmetic and the CESTAC method to validate the results. We show that the He’s iteration formula is more reliable than the Newton’s iteration formula by using the CADNA library.
متن کاملDynamical Control of Computations Using the Family of Optimal Two-point Methods to Solve Nonlinear Equations
One of the considerable discussions for solving the nonlinear equations is to find the optimal iteration, and to use a proper termination criterion which is able to obtain a high accuracy for the numerical solution. In this paper, for a certain class of the family of optimal two-point methods, we propose a new scheme based on the stochastic arithmetic to find the optimal number of iterations in...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملOn the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملTheoretical results on the global GMRES method for solving generalized Sylvester matrix equations
The global generalized minimum residual (Gl-GMRES) method is examined for solving the generalized Sylvester matrix equation [sumlimits_{i = 1}^q {A_i } XB_i = C.] Some new theoretical results are elaborated for the proposed method by employing the Schur complement. These results can be exploited to establish new convergence properties of the Gl-GMRES method for solving genera...
متن کامل